The Frobenius problem for numerical semigroups with embedding dimension equal to three
نویسندگان
چکیده
If S is a numerical semigroup with embedding dimension equal to three whose minimal generators are pairwise relatively prime numbers, then S = 〈a, b, cb − da〉 with a, b, c, d positive integers such that gcd(a, b) = gcd(a, c) = gcd(b, d) = 1, c ∈ {2, . . . , a− 1}, and a < b < cb− da. In this paper we give formulas, in terms of a, b, c, d, for the genus, the Frobenius number, and the set of pseudo-Frobenius numbers of 〈a, b, cb− da〉 in the case in which the interval [ a c , b d ] contains some integer.
منابع مشابه
The Frobenius problem for numerical semigroups
In this paper, we characterize those numerical semigroups containing 〈n1, n2〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.
متن کاملOn Numerical Semigroups with Embedding Dimension Three
Let f ̸= 1, 3 be a positive integer. We prove that there exists a numerical semigroup S with embedding dimension three such that f is the Frobenius number of S. We also show that the same fact holds for affine semigroups in higher dimensional monoids.
متن کاملNumerical Semigroups with a Monotonic Apéry Set
We study numerical semigroups S with the property that ifm is the multiplicity of S and w(i) is the least element of S congruent with i modulo m, then 0 < w(1) < . . . < w(m − 1). The set of numerical semigroups with this property and fixed multiplicity is bijective with an affine semigroup and consequently it can be described by a finite set of parameters. Invariants like the gender, type, emb...
متن کاملAlmost Symmetric Numerical Semigroups Generated by Four Elements
In this paper, we study almost symmetric numerical semigroups generated by 4-elements. Rosales and Garćıa-Sánchez [RG2] proved that every almost symmetric numerical semigroup can be constructed by removing some minimal generators from an irreducible numerical semigroup with the same Frobenius number. Using this result, we concretely construct almost symmetric numerical semigroups generated by 4...
متن کاملOn a Question of Wilf concerning Numerical Semigroups
Let S be a numerical semigroup with embedding dimension e(S), Frobenius number g(S), and type t(S). Put n(S) := Card(S ∩ {0, 1, . . . , g(S)}). A question of Wilf is shown to be equivalent to the statement that e(S)n(S) ≥ g(S)+1. This question is answered affirmatively if S is symmetric, pseudo-symmetric, or of maximal embedding dimension. The question is also answered affirmatively in the foll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 81 شماره
صفحات -
تاریخ انتشار 2012